Crosstalk noise and bit error rate analysis for optical network%2Don%2Dchip.

IP Fast Reroute NotVia with Early Decapsulation.

A method for modeling drivers%27 behavior rules in agent%2Dbased traffic simulation.

Development of a pedestrian evacuation model for urban chemical release emergency.

Study of spacializing social statistical data for carbon management.

Visualized emergency planning system based on GIS and scenario analysis technology.

Analysis of Stakeholder%2FValue Dependency Patterns and Process Implications A Controlled Experiment.

An integrated spatio%2Dtemporal modeling and analysis framework for climate change research.

Analysis of Stakeholder%2FValue Dependency Patterns and Process Implications A Controlled Experiment.

Robust speaker identification using an auditory%2Dbased feature.

Measurement and Analysis of Process Audit A Case Study.

Improving the ROI of Software Quality Assurance Activities An Empirical Study.

An intelligent system for accelerating parallel SVM classification problems on large datasets using GPU.

An Improved Control Strategy for Ball Mill Grinding Circuits.

Research on Data Processing of RFID Middleware Based on Cloud Computing.

Using diffusion distances for flexible molecular shape comparison.

Global uniform asymptotical stability of a class of nonlinear cascaded systems with application to a nonholonomic wheeled mobile robot.

Real%2Dtime motion deblurring algorithm with robust noise suppression.

New similarity measures of localities for a two%2Dlayer matching scheme and estimation of fundamental matrices.

Maneuvering targets state prediction based on robust H INFINITY  filtering in opto%2Delectronic tracking system.

GBED group based event detection method for audio sensor networks.

Multisensory Interaction of Audiovisual Stimuli on the Central and Peripheral Spatial Locations A Behavioral Study.

An Algorithm of Quantitative Association Rule on Fuzzy Clustering with Application to Cross%2DSelling in Telecom Industry.

A Sensemaking%2Dbased Information Foraging and Summarization System in Business Environments.

Improving IGP Convergence through Distributed OSPF in Scalable Router.

Productivity trends in incremental and iterative software development.

Improving IGP Convergence through Distributed OSPF in Scalable Router.

A portable USB%2Dbased microphone array device for robust speech recognition.

A global%2Dto%2Dlocal scheme for imbalanced point matching.

Detecting image points of general imbalance.

A Study of Relation Annotation in Business Environments Using Web Mining.

Data transformation and attribute subset selection Do they help make differences in software failure prediction%3F

Bridge the Gap between Software Test Process and Business Value A Case Study.

Contour Extraction of Drosophila Embryos.

A Geospatial Information Portal for Emergency Management of Natural Disasters.

An Analysis of the Third Party Payment System based on Service Supply Chain.

A Neural Network Based Framework for Audio Scene Analysis in Audio Sensor Networks.

Towards secure dynamic collaborations with group%2Dbased RBAC model.

Expert system based adaptive dynamic matrix control for ball mill grinding circuit.

Interest Points of General Imbalance.

Usage control platformization via trustworthy SELinux.

Query Expansion for Effective Geographic Information Retrieval.

Reducing biases in individual software effort estimations a combining approach.

Educational social linking in example authoring.

Towards a Group%2DBased RBAC Model and Decentralized User%2DRole Administration.

The e%2Dcommerce transaction statistics in developing countries.

An automatic framework for standardization of drosophila embryonic images.

Detecting image points of diverse imbalance.

Evaluating Service Scalability of Network Architectures.
Washington • TokyoSeventh International Conference on Networking ICN 2008 Table of Contents Preface........................................................................................................................................................xiv
An empirical analysis on distribution patterns of software maintenance effort.

A Robust Endpoint Detection Algorithm for Video Caption Generation.

A hash%2DTLB approach for MMU virtualization in xen%2FIA64.
With advances in hardware-assisted full virtualization technologies, system virtualization based on the virtual machine monitor (VMM) has received much recent attention. Using the Xen/IA64 hardware virtual machine implemented on Intel R ○ Virtualization Technology for Itanium(VT-i), we investigate the design of a virtual software hash translation lookaside buffer (TLB) based on the virtual hash page table (VHPT). Experimental results show that the proposed design can significantly improve the performance of the hardware virtual machine of Xen/IA64. Our contributions are the following. First, we design and implement in the VMM a virtual hash TLB algorithm to optimize the system performance of VT-i guest virtual machines. Second, we quantify experimentally the performance benefits of the hash TLB for VT-i guest virtual machines and analyze the performance impact of the software VHPT walker with the hash TLB algorithm. Lastly, we present experiments to verify, in an SMP virtual machine system environment, the superior scalability of the hash TLB approach. 1
Access control in Group Communication Systems.
In this paper we analyze the requirements access control mechanisms must fulfill in the context of group communication and define a framework for supporting fine-grained access control in client-server group communication systems. Our framework combines rolebased access control mechanisms with environment parameters (time, IP address, etc.) to provide support for a wide range of applications with very different requirements. While the access control policy is defined by the application, its efficient enforcement is performed by the group communication system. 1
A Study of Path Protection in Self%2DHealing Routing.

Learning subspace kernels for classification.
Kernel methods have been applied successfully in many data mining tasks. Subspace kernel learning was recently proposed to discover an effective low-dimensional subspace of a kernel feature space for improved classification. In this paper, we propose to construct a subspace kernel using the Hilbert-Schmidt Independence Criterion (HSIC). We show that the optimal subspace kernel can be obtained efficiently by solving an eigenvalue problem. One limitation of the existing subspace kernel learning formulations is that the kernel learning and classification are independent and the subspace kernel may not be optimally adapted for classification. To overcome this limitation, we propose a joint optimization framework, in which we learn the subspace kernel and subsequent classifiers simultaneously. In addition, we propose a novel learning formulation that extracts an uncorrelated subspace kernel to reduce the redundant information in a subspace kernel. Following the idea from multiple kernel learning, we extend the proposed formulations to the case when multiple kernels are available and need to be combined. We show that the integration of subspace kernels can be formulated as a semidefinite program (SDP) which is computationally expensive. To improve the efficiency of the SDP formulation, we propose an equivalent semi-infinite linear program (SILP) formulation which can be solved efficiently by the column generation technique. Experimental results on a collection of benchmark data sets demonstrate the effectiveness of the proposed algorithms.
A Study of Path Protection in Self%2DHealing Routing.

A Flexible Framework for Audio Semantic Content Detection.

VNIDA Building an IDS Architecture Using VMM%2DBased Non%2DIntrusive Approach.

Personalized web exploration with task models.
Personalized Web search has emerged as one of the hottest topics for both the Web industry and academic researchers. However, the majority of studies on personalized search focused on a rather simple type of search, which leaves an important research topic – the personalization in exploratory searches – as an under-studied area. In this paper, we present a study of personalization in taskbased information exploration using a system called TaskSieve. TaskSieve is a Web search system that utilizes a relevance feedback based profile, called a “task model”, for personalization. Its innovations include flexible and user controlled integration of queries and task models, task-infused text snippet generation, and on-screen visualization of task models. Through an empirical study using human subjects conducting task-based exploration searches, we demonstrate that TaskSieve pushes significantly more relevant documents to the top of search result lists as compared to a traditional search system. TaskSieve helps users select significantly more accurate information for their tasks, allows the users to do so with higher productivity, and is viewed more favorably by subjects under several usability related characteristics.
Supervisory expert control for ball mill grinding circuits.

Multi%2Dfocus color image fusion in the HSI space using the sum%2Dmodified%2Dlaplacian and a coarse edge map.

Adaptive Appearance Based Face Recognition.

An evaluation of identity representability of facial expressions using feature distributions.

Interest point detection using imbalance oriented selection.

Analysis and case study on multi%2Ddimensional scalability of the Internet architecture.

A multidimensional scaling approach for representing XML documents.

A novel method of infrared image denoising and edge enhancement.

A multidimensional scaling approach for representing XML documents.



Fuzzy Logic Based On%2DLine Efficiency Optimization Control of a Ball Mill Grinding Circuit.

Flexible Authorization with Decentralized Access Control Model for Grid Computing.
With the increasing complexity of dynamic and collaborative computing environments in Grid, security management has become a critical factor. Although several approaches have been proposed, fully decentralized and efficient authorization management is still a challenging problem. We propose an access control scheme based on a group-based RBAC model for Grid computing environments. By separating the administrations of users by VO level policies and permissions by resource or service provider policies, our scheme provides decentralized, autonomous, and fine-grained security management which fits the dynamic environment of Grids, and can support ad-hoc collaborations. We implement a proof-of-concept prototype system by enhancing the access control module in Grid File System (GFS) and specifying different levels of policies with XACML. 1
Multimodality Image Registration by Particle Swarm Optimization of Mutual Information.

Empowering Patients to Improve the Quality of Their Care Design and Implementation of a Shared Health Maintenance Module in a US Integrated Healthcare Delivery Network.

How Up%2Dto%2Ddate should it be%3F the Value of Instant Profiling and Adaptation in Information Filtering.

Efficient model selection for regularized linear discriminant analysis.
Classical Linear Discriminant Analysis (LDA) is not applicable for small sample size problems due to the singularity of the scatter matrices involved. Regularized LDA (RLDA) provides a simple strategy to overcome the singularity problem by applying a regularization term, which is commonly estimated via cross-validation from a set of candidates. However, cross-validation may be computationally prohibitive when the candidate set is large. An efficient algorithm for RLDA is presented that computes the optimal transformation of RLDA for a large set of parameter candidates, with approximately the same cost as running RLDA a small number of times. Thus it facilitates efficient model selection for RLDA. An intrinsic relationship between RLDA and Uncorrelated LDA (ULDA), which was recently proposed for dimension
Model and method for evaluating creditability of C2C electronic trade.

Identity Representability of Facial Expressions An Evaluation Using Feature Pixel Distributions.

Adaptive Appearance Based Face Recognition.

Soft Sensing Based on LS%2DSVM and Its Application to a Distillation Column.

Design Study of Adaptive Fuzzy PID Controller for LOS Stabilized System.

Feature Reduction via Generalized Uncorrelated Linear Discriminant Analysis.

Spatial interest pixels %28SIPs%29 useful low%2Dlevel features of visual media data.
for many important applications. The biggest challenge in using visual media data comes from the extremely high dimensionality. We present a comparative study on spatial interest pixels (SIPs), including eight-way (a novel SIP miner), Harris, and Lucas-Kanade, whose extraction is considered as an important step in reducing the dimensionality of visual media data. With extensive case studies, we have shown the usefulness of SIPs as the lowlevel features of visual media data. A class-preserving dimension reduction algorithm (using GSVD) is applied to further reduce the dimension of feature vectors based on SIPs. The experiments showed its superiority over PCA.
Proceedings of the 7th International Conference on Electronic Commerce
Abstract. ’Quality &amp; taste ’ products like wine or fine cigars are one of the fastest growing product sectors in e-commerce. Online shops for these types of products require on the one side persuasive Web presentation and on the other side deep product knowledge. In that context recommender applications may help to create an enjoyable shopping experience for online users. The Advisor Suite framework is a knowledge-based conversational recommender system that aims at mediating between requirements and desires of online shoppers and technical characteristics of the product domain. In this paper we present a conceptual scheme to classify the driving factors for creating a persuasive online shopping experience with recommender systems. We discuss these concepts on the basis of several fielded applications. Furthermore, we give qualitative results from a long-term evaluation in the domain of Cuban cigars. 1
An Administration Model of DRBAC on the Web.

The application of exchange oriented three%2Ddimensional e%2Dcommerce model cases based explanation.

Probe into construction of e%2Dcommerce major in undergraduate degree the experience of Xi%27an institute of post and telecoms.


The Use of Complex Contourlet Transform on Fusion Scheme.


IDR%2FQR An Incremental Dimension Reduction Algorithm via QR Decomposition.
Dimension reduction is critical for many database and data mining applications, such as e#cient storage and retrieval of high-dimensional data. In the literature, a well-known dimension reduction scheme is Linear Discriminant Analysis (LDA). The common aspect of previously proposed LDA based algorithms is the use of Singular Value Decomposition (SVD). Due to the di#culty of designing an incremental solution for the eigenvalue problem on the product of scatter matrices in LDA, there is little work on designing incremental LDA algorithms. In this paper, we propose an LDA based incremental dimension reduction algorithm, called IDR/QR, which applies QR Decomposition rather than SVD. Unlike other LDA based algorithms, this algorithm does not require the whole data matrix in main memory. This is desirable for large data sets. More importantly, with the insertion of new data items, the IDR/QR algorithm can constrain the computational cost by applying e#cient QR-updating techniques. Finally, we evaluate the e#ectiveness of the IDR/QR algorithm in terms of classification accuracy on the reduced dimensional space. Our experiments on several real-world data sets reveal that the accuracy achieved by the IDR/QR algorithm is very close to the best possible accuracy achieved by other LDA based algorithms. However, the IDR/QR algorithm has much less computational cost, especially when new data items are dynamically inserted.
A Two%2DStage Linear Discriminant Analysis via QR%2DDecomposition.
Abstract—Linear Discriminant Analysis (LDA) is a well-known method for feature extraction and dimension reduction. It has been used widely in many applications involving high-dimensional data, such as image and text classification. An intrinsic limitation of classical LDA is the so-called singularity problems; that is, it fails when all scatter matrices are singular. Many LDA extensions were proposed in the past to overcome the singularity problems. Among these extensions, PCA+LDA, a two-stage method, received relatively more attention. In PCA+LDA, the LDA stage is preceded by an intermediate dimension reduction stage using Principal Component Analysis (PCA). Most previous LDA extensions are computationally expensive, and not scalable, due to the use of Singular Value Decomposition or Generalized Singular Value Decomposition. In this paper, we propose a two-stage LDA method, namely LDA/QR, which aims to overcome the singularity problems of classical LDA, while achieving efficiency and scalability simultaneously. The key difference between LDA/QR and PCA+LDA lies in the first stage, where LDA/QR applies QR decomposition to a small matrix involving the class centroids, while PCA+LDA applies PCA to the total scatter matrix involving all training data points. We further justify the proposed algorithm by showing the relationship among LDA/QR and previous LDA methods. Extensive experiments on face images and text documents are presented to show the effectiveness of the proposed algorithm. Index Terms—Linear discriminant analysis, dimension reduction, QR decomposition, classification. 1
Performance%2Dimproving techniques in web%2Dbased GIS.

Using qualitative studies to improve the usability of an EMR.

Primary care physician time utilization before and after implementation of an electronic health record A time%2Dmotion study.

Linear Projection Methods in Face Recognition under Unconstrained Illuminations A Comparative Study.
Face recognition under unconstrained illuminations (FR/I) received extensive study because of the existence of illumination subspace. [2] presented a study on the comparison between Principal component analysis (PCA) and subspace Linear Discriminant Analysis (LDA) for this problem. PCA and subspace LDA are two well-known linear projection methods that can be characterized as trace optimization on scatter matrices. Generally, a linear projection method can be derived by applying a specific matrix analysis technique on specific scatter matrices under some optimization criterion. Several novel linear projection methods were proposed recently using Generalized Singular Value Decomposition or QR Decomposition matrix analysis techniques [10, 17, 11]. In this paper, we present a comparative study on these linear projection methods in FR/I. We further involve multiresolution analysis in the study. Our comparative study is expected to give a relatively comprehensive view on the performance of linear projection methods in FR/I problems.
Three dimensional model an analyzing sketch for e%2Dcommerce theories and applications.

Feature extraction via generalized uncorrelated linear discriminant analysis.

GPCA an efficient dimension reduction scheme for image compression and retrieval.

IDR%2FQR an incremental dimension reduction algorithm via QR decomposition.
Dimension reduction is critical for many database and data mining applications, such as e#cient storage and retrieval of high-dimensional data. In the literature, a well-known dimension reduction scheme is Linear Discriminant Analysis (LDA). The common aspect of previously proposed LDA based algorithms is the use of Singular Value Decomposition (SVD). Due to the di#culty of designing an incremental solution for the eigenvalue problem on the product of scatter matrices in LDA, there is little work on designing incremental LDA algorithms. In this paper, we propose an LDA based incremental dimension reduction algorithm, called IDR/QR, which applies QR Decomposition rather than SVD. Unlike other LDA based algorithms, this algorithm does not require the whole data matrix in main memory. This is desirable for large data sets. More importantly, with the insertion of new data items, the IDR/QR algorithm can constrain the computational cost by applying e#cient QR-updating techniques. Finally, we evaluate the e#ectiveness of the IDR/QR algorithm in terms of classification accuracy on the reduced dimensional space. Our experiments on several real-world data sets reveal that the accuracy achieved by the IDR/QR algorithm is very close to the best possible accuracy achieved by other LDA based algorithms. However, the IDR/QR algorithm has much less computational cost, especially when new data items are dynamically inserted.
Efficient Kernel Discriminant Analysis via QR Decomposition.

Two%2DDimensional Linear Discriminant Analysis.
Human gait is an effective biometric source for human identification and visual surveillance; therefore human gait recognition becomes to be a hot topic in recent research. However, the elapsed time problem, which is in its infancy, still receives poor performance. In this paper, we introduce a novel discriminant analysis method to improve the performance. The new model inherits the merits from the tensor rank one analysis, which handles the small samples size problem naturally, and the linear discriminant analysis, which is optimal for classification. Although 2DLDA and DATR also benefit from these two methods, they cannot converge during the training procedure. This means they can be hardly utilized for practical applications. Based on a lot of experiments on elapsed time problem in human gait recognition, the new method is demonstrated to significantly outperform the existing appearance-based methods, such as the principle component analysis, the linear discriminant analysis, and the tensor rank one analysis. 1.
LDA%2FQR an efficient and effective dimension reduction algorithm and its theoretical foundation.

Influencing factors of securities e%2Dcommerce in China.

Spatial Interest Pixels %28SIPs%29 Useful Low%2DLevel Features of Visual Media Data.
for many important applications. The biggest challenge in using visual media data comes from the extremely high dimensionality. We present a comparative study on spatial interest pixels (SIPs), including eight-way (a novel SIP miner), Harris, and Lucas-Kanade, whose extraction is considered as an important step in reducing the dimensionality of visual media data. With extensive case studies, we have shown the usefulness of SIPs as the lowlevel features of visual media data. A class-preserving dimension reduction algorithm (using GSVD) is applied to further reduce the dimension of feature vectors based on SIPs. The experiments showed its superiority over PCA.
Gene Functional Classification by Semisupervised Learning from Heterogeneous Data.

A Framework of Individually%2DFocused Teleconferencing %28IFT%29 via an Efficient 3D Reprojection Technique.

A comparative study on content%2Dbased music genre classification.
Content-based music genre classification is a fundamental component of music information retrieval systems and has been gaining importance and enjoying a growing amount of attention with the emergence of digital music on the Internet. Currently little work has been done on automatic music genre classification, and in addition, the reported classification accuracies are relatively low. This paper proposes a new feature extraction method for music genre classification, DWCHs 1. DWCHs capture the local and global information of music signals simultaneously by computing histograms on their Daubechies wavelet coefficients. Effectiveness of this new feature and of previously studied features are compared using various machine learning classification algorithms, including Support Vector Machines and Linear Discriminant Analysis. It is demonstrated that the use of DWCHs significantly improves the accuracy of music genre classification.
UMass at TREC 2003 HARD and QA.
• In the HARD track, we developed document metadata to correspond to query metadata requirements; implemented clarification forms based on query expansion, passage retrieval, and clustering; and retrieved variable length passages deemed most likely to be relevant. This work is discussed at length in Section 1. • In the QA track, we focused on retrieving passages that were likely to contain the answer to the question. 1 HARD track 1.1 Overview The goal of the High Accuracy Retrieval from Documents track was to explore techniques for improving the accuracy of the top-ranked documents in response to a query. We participated in all three aspects of the problem: • We mapped query metadata values to document metadata values that we assigned. We then adjusted the ranking of documents depending on whether their metadata matched the query metadata. • We generated clarification forms to tease more information out of the searcher. We tried several types of clarification forms, including providing a list of keywords that might appear in relevant documents, a list of top-ranking clusters that might contain relevant documents, and a list of passages that might appear in relevant documents. • We explored passage-level retrieval of documents to see if we could pinpoint the relevant portions of documents. In the final analysis, all runs using metadata or clarification forms failed to outperform our best baseline run. We interpret
Improving Medical%2FBiological Data Classification Performance by Wavelet Preprocessing.
Many real-world datasets contain noise and noise could degrade the performances of learning algorithms. Motivated from the success of wavelet denoising techniques in image data, we explore a general solution to alleviate the eect of noisy data by wavelet preprocessing for medical/biological data classi  cation. Our experiments are divided into two categories: one is of dierent classi  cation algorithms  on a speci  c database (Ecoli [6]) and the other is of a speci  c classi  cation algorithm (decision tree) on dierent databases. The experiment results show that the wavelet denoising of noisy data is able to improve the accuracies of those classi  cation methods, if the localities of the attributes are strong enough.
Toward Speech%2DGenerated Cryptographic Keys on Resource%2DConstrained Devices.

Robust endpoint detection and energy normalization for real%2Dtime speech and speaker recognition.
Abstract—When automatic speech recognition (ASR) and speaker verification (SV) are applied in adverse acoustic environments, endpoint detection and energy normalization can be crucial to the functioning of both systems. In low signal-to-noise ratio (SNR) and nonstationary environments, conventional approaches to endpoint detection and energy normalization often fail and ASR performances usually degrade dramatically. The purpose of this paper is to address the endpoint problem. For ASR, we propose a real-time approach. It uses an optimal filter plus a three-state transition diagram for endpoint detection. The filter is designed utilizing several criteria to ensure accuracy and robustness. It has almost invariant response at various background noise levels. The detected endpoints are then applied to energy normalization sequentially. Evaluation results show that the proposed algorithm significantly reduces the string error rates in low SNR situations. The reduction rates even exceed 50 % in several evaluated databases. For SV, we propose a batch-mode approach. It uses the optimal filter plus a two-mixture energy model for endpoint detection. The experiments show that the batch-mode algorithm can detect endpoints as accurately as using HMM forced alignment while the proposed one has much less computational complexity. Index Terms—Change-point detection, edge detection, endpoint detection, optimal filter, robust speech recognition, speaker verification, speech activity detection, speech detection. I.
A Survey on Wavelet Applications in Data Mining.
Recently there has been significant development in the use of wavelet methods in various data mining processes. However, there has been written no comprehensive survey available on the topic. The goal of this is paper to fill the void. First, the paper presents a high-level data-mining framework that reduces the overall process into smaller components. Then applications of wavelets for each component are reviewd. The paper concludes by discussing the impact of wavelets on data mining research and outlining potential future research directions and applications.
Cryptographic Key Generation from Voice.
We propose a technique to reliably generate a cryptographic key from a user’s voice while speaking a password. The key resists cryptanalysis even against an attacker who captures all system information related to generating or verifying the cryptographic key. Moreover, the technique is sufficiently robust to enable the user to reliably regenerate the key by uttering her password again. We describe an empirical evaluation of this technique using 250 utterances recorded from 50 users. 1.
Spatial Information System and Golden Bridge Engineering.

Gro%DFfl%E4chige Landnutzungsbestimmung aus Landsat%2D5%2DTM%2DDaten.

